Constructive Interval Disjunction

نویسندگان

  • Gilles Trombettoni
  • Gilles Chabert
چکیده

This paper presents two new filtering operators for numerical CSPs (systems with constraints over the reals) based on constructive disjunction, as well as a new splitting heuristic. The fist operator (CID) is a generic algorithm enforcing constructive disjunction with intervals. The second one (3BCID) is a hybrid algorithm mixing constructive disjunction and shaving, another technique already used with numerical CSPs through the algorithm 3B. Finally, the splitting strategy learns from the CID filtering step the next variable to be split, with no overhead. Experiments have been conducted with 20 benchmarks. On several benchmarks, CID and 3BCID produce a gain in performance of orders of magnitude over a standard strategy. CID compares advantageously to the 3B operator while being simpler to implement. Experiments suggest to fix the CID-related parameter in 3BCID, offering thus to the user a promising variant of 3B.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructive Disjunction Revisited

Finite Domain Programming is a technique for solving com-binatorial problems like planning, scheduling, connguration or timetabling. Inevitably, these problems employ disjunctive constraints. A rather new approach to model those constraints is constructive disjunction, whereby common information is lifted from the alternatives, aiming for stronger pruning of the search space. We show where cons...

متن کامل

Compiling and Executing Disjunctions of Finite Domain Constraints Compiling and Executing Disjunctions of Finite Domain Constraints

We present two schemes for compiling disjunctions of nite domain constraints, where disjunction is treated as constructive. In the rst scheme each disjunction is compiled to a set of indexicals, i.e. a set of range functions computing domain restrictions, such that the evaluation of the indexicals maintains a weak form of consistency of the disjunction. The second scheme is based on constraint ...

متن کامل

Constructive Disjunction in Oz

Constraint programming has been proved as an excellent tool to solve combinatori-al problems in many application areas. Through constraint propagation large parts of the search space can be pruned away. Hard problems are those which involve disjunc-tive constraints introducing non-determinism. While the introduction of choice-points for disjunctive constraints may lead to combinatorial explosio...

متن کامل

The disjunction and related properties for constructive Zermelo-Fraenkel set theory

This paper proves that the disjunction property, the numerical existence property, Church’s rule, and several other metamathematical properties hold true for Constructive Zermelo-Fraenkel Set Theory, CZF, and also for the theory CZF augmented by the Regular Extension Axiom. As regards the proof technique, it features a self-validating semantics for CZF that combines realizability for extensiona...

متن کامل

Compiling and Executing Disjunctions of Finite Domain Constraints

We present two schemes for compiling disjunctions of nite domain constraints, where disjunction is treated as constructive. In the rst scheme each disjunction is compiled to a set of indexicals, i.e. a set of range functions computing domain restrictions, such that the evaluation of the indexicals maintains a weak form of consistency of the disjunction. The second scheme is based on constraint ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007